//
// Created by Jisam on 18/09/2025 23:03.
// Solution of  HJ76.cpp
#include <bits/stdc++.h>
#define  int long long
#define  endl "\n"
#define  all(x) (x).begin(),(x).end()
#define  pb push_back
using namespace std;

int sum(int a,int b, int n){
    int ans = 0;
    int cnt = 0;
    for(int i = a; i <= b; i ++){
        ans += (i % 2 == 1) ? i : 0;
        cnt += (i % 2 == 1) ? 1 : 0;
    }
    return (cnt == n) ? ans : -1;
}
void print(int a,int b){
    int f = 0;
    for(int i = a; i <= b; i ++){
        if(i % 2 == 1){
            if(f == 0) {cout << i; f = 1;}
            else cout << "+"  << i;
        }
    }
}
int a[3000] = {0};
signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    for(int i = 0; i <= 3000 ;i ++){
        a[i] = i * 2 + 1;
    }
    for(int i = 1; i <= 3000 ; i ++){
        a[i] = a[i - 1] + a[i];
    }
    for(int i = 0 ; i <= 3000; i ++){
        int sum = a[i + n] - a[i];
        if(sum == n * n * n) {
            print(a[i], a[i + n]);
            return 0;
        }
    }
    return 0;
}